Monotonicity and the Aumann-Shapley cost-sharing method in the discrete case
نویسندگان
چکیده
We give an axiomatization of the Aumann-Shapley cost-sharing method in the discrete case by means of monotonicity and no merging or splitting (Sprumont, 2005 [16]). Monotonicity has not yet been employed to characterize this method in such a case, unlike the case in which goods are perfectly divisible, for which Monderer and Neyman (1988) [10] and Young (1985) [19] characterize the Aumann-Shapley price mechanism. We also o¤er two variations of our main axiomatization. JEL Classi cation: C71.
منابع مشابه
Optimization Based Characterizations of Cost Sharing Methods
We provide several new characterizations of well known cost sharing methods (CSMs) as maxima of linear (or convex) functionals. For the Shapley-Shubik method the characterization has an interpretation in terms of randomly ordered agents choosing their most preferred CSM, while the characterizations of the Aumann-Shapley and Serial methods have a very general character: any symmetric convex func...
متن کاملAlternative Axiomatic Characterizations of the Grey Shapley Value
The Shapley value, one of the most common solution concepts of cooperative game theory is defined and axiomatically characterized in different game-theoretic models. Certainly, the Shapley value can be used in interesting sharing cost/reward problems in the Operations Research area such as connection, routing, scheduling, production and inventory situations. In this paper, we focus on the Shapl...
متن کاملPaths and Consistency in Additive Cost Sharing Eric
Using a new representation theorem for additive cost sharing methods as sums of path methods, we show that many of the standard additive cost sharing methods (Aumann-Shapley, Shapley Shubik, and Serial Cost) are consistent. These results follow directly from a simple su cient condition for consistency: being generated by associative paths, which can be used to show consistency for many other me...
متن کاملPaths and consistency in additive cost sharing
Using a new representation theorem for additive cost sharing methods as sums of path methods, we show that many of the standard additive cost sharing methods (Aumann-Shapley, Shapley Shubik, and Serial Cost) are consistent. These results follow directly from a simple suucient condition for consistency: being generated by associative paths, which can be used to show consistency for many other me...
متن کاملFair Allocation of Production Externalities: Recent Results
We survey recent axiomatic results in the theory of cost-sharing. In this litterature, a method computes the individual cost shares assigned to the users of a facility for any profile of demands and any monotonic cost function. We discuss two theories taking radically different views of the asymmetries of the cost function. In the full responsibility theory, each agent is accountable for the pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- European Journal of Operational Research
دوره 238 شماره
صفحات -
تاریخ انتشار 2014